On Permutation Cliques
نویسنده
چکیده
The symmetric group S , is a metric space with distance d(a , b ) = IE(a-'b)( where E ( c ) is the set of points moved by c E S,. Let L be a given subset of {I. 2, . . . , n}, a permutation clique A = A(L, n ) is any subset A c S , with d(a, b ) E L whenever a, b E A , a # b. We give a framework of new and known information o n some special A = A ( L , n): maximal, largest, largest subgroups of S,, subscheme of Hamming metric scheme, permutation geometry and some other problems related to this metric space. Some links with classical problems of classification of permutation groups and with extrernal problems on finite sets are given.
منابع مشابه
A Deterministic Protocol for Permutation Routing in Dense Multi-Hop Sensor Networks
A large variety of permutation routing protocols in a single-hop Network are known in the literature. Since they are single hop, there is always a wireless link connecting two nodes. One way to solve this problem in a multiple hop environment is to partition nodes into clusters, where a node in each cluster called clusterhead is responsible for the routing service. In this paper, we propose a h...
متن کاملA Secure permutation routing protocol in multi-hop wireless sensor networks
A growing number of researches is done on the permutation routing problem in wireless networks, however, none of these studies do address the problems of security in the permutation routing in wireless sensor networks, The permutation routing problem in a military application is the fact that each soldier has items (information), that not concerned by him, and perhaps data which concerned, that...
متن کاملA fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants) Abstract We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be embedded in a simple algorithm that in at ...
متن کاملCliques Role in Organizational Reputational Influence: A Social Network Analysis
Empirical support for the assumption that cliques are major determinants of reputational influence derives largely from the frequent finding that organizations which claimed that their cliques’ connections are influential had an increased likelihood of becoming influential themselves. It is suggested that the strong and consistent connection in cliques is at least partially responsible for the ...
متن کاملRegular clique covers of graphs
A family of cliques in a graph G is said to be p-regular if any two cliques in the family intersect in exactly p vertices. A graph G is said to have a p-regular k-clique cover if there is a p-regular family H of k-cliques of G such that each edge of G belongs to a clique in H. Such a p-regular kclique cover is separable if the complete subgraphs of order p that arise as intersections of pairs o...
متن کامل